Koha online

Normal view MARC view ISBD view

Computational complexity of counting and sampling

By: Miklos, Istvan.
Series: Discrete mathematics and its applications.Publisher: Boca Raton Chapman and Hall/ CRC 2018Description: xvii, 390 p. 23 cm.ISBN: 9781138035577.Subject(s): Computational complexity | Sampling Statistics | Combinatorics | ArithmeticDDC classification: 511.352 Summary: The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 511.352 MIK (Browse shelf) Available 032180

Includes bibliographical references.

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha